Parametric Fixed-Point Iteration Implemented in C-XSC

نویسندگان

  • Evgenija D. Popova
  • Walter Krämer
  • Evgenija Popova
چکیده

Consider linear systems whose matrix and right-hand side vector depend affinelinearly on parameters varying within prescribed intervals. We present a C-XSC [9] implementation of a parametric fixed-point iteration method for the verified enclosure of the parametric solution set. Input data for the system have an entirely numerical representation by dense twodimensional matrices. Some specific features of the corresponding algorithm concerning sharp enclosure of the contracting matrix, epsilon inflation, and inner approximation of the solution enclosure are discussed. Numerical examples illustrate the application of the presented software and the discussed specific features of the algorithm. Our software seems to be the first open source software delivering verified results in the field of parametric linear systems (inner and outer estimations for the hull of the solution set). The source code is available at http://www.math.uni-wuppertal.de/wrswt/xsc/cxsc−software.html. The software will be developed further.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inner and Outer Bounds for the Solution Set of Parametric Linear Systems

Consider linear systems involving affine-linear dependencies on interval parameters. Presented is a free C-XSC software implementing a generalized parametric fixed-point iteration method for verified enclosure of the parametric solution set. Some specific features of the corresponding algorithm concerning sharp enclosure of the contracting matrix and inner approximation of the solution enclosur...

متن کامل

Solving time-fractional chemical engineering equations by modified variational iteration method as fixed point iteration method

The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...

متن کامل

C – XSC 2.0: A C++ Class Library for Extended Scientific Computing

The original version of the C++ class library C – XSC [4] is about ten years old. But in the last decade the underlying programming language C++ has been developed significantly. Since November 1998 the C++ standard [3] is available and more and more compilers support (most of) the features of this standard. The new version C – XSC 2.0 [2] conforms to the C++ standard. For those who are not fam...

متن کامل

New three-step iteration process and fixed point approximation in Banach spaces

‎In this paper we propose a new iteration process‎, ‎called the $K^{ast }$ iteration process‎, ‎for approximation of fixed‎ ‎points‎. ‎We show that our iteration process is faster than the existing well-known iteration processes using numerical examples‎. ‎Stability of the $K^{ast‎}‎$ iteration process is also discussed‎. ‎Finally we prove some weak and strong convergence theorems for Suzuki ge...

متن کامل

Iterative scheme based on boundary point method for common fixed‎ ‎point of strongly nonexpansive sequences

Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004